On High Order Barycentric Root-Finding Methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Root finding by high order iterative methods based on quadratures

We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with n+ 1 nodes is used the resulting iterative method has convergence order at least n+ 2, starting with the case n = 0 (which corresponds to the Newton’s method).

متن کامل

A new family of four-step fifteenth-order root-finding methods with high efficiency index

‎In this paper a new family of fifteenth-order methods with high efficiency index is presented‎. This family include four evaluations of the function and one evaluation of its first derivative per iteration.‎ ‎Therefore‎, ‎this family of methods has the efficiency index which equals 1.71877‎. ‎In order to show the applicability and validity of the class‎, ‎some numerical examples are discussed‎.

متن کامل

On the Fourth Order Root Finding Methods of Euler’s Type

A new iterative method of the fourth order for solving nonlinear equations of the form f(x) = 0 is derived. The comparison with other existing methods is performed regarding the computational efficiency and numerical examples. The fourth-order derivative free method for the simultaneous calculation of all polynomial zeros, arising from the proposed method, is also studied. AMS Mathematics Subje...

متن کامل

On a family of Weierstrass-type root-finding methods with high order of convergence

in English: In 1985, Kyurkchiev and Andreev [1] constructed a sequence of iterative methods for finding all zeros of a polynomial simultaneously. In the literature there are only local convergence results for these methods (see [1, 5]). In this talk, we present a semilocal convergence theorem for Kyurkchiev-Andreev’s methods under computationally verifiable initial conditions and with an a post...

متن کامل

a new family of four-step fifteenth-order root-finding methods with high efficiency index

‎in this paper a new family of fifteenth-order methods with high efficiency index is presented‎. this family include four evaluations of the function and one evaluation of its first derivative per iteration.‎ ‎therefore‎, ‎this family of methods has the efficiency index which equals 1.71877‎. ‎in order to show the applicability and validity of the class‎, ‎some numerical examples are discussed‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TEMA (São Carlos)

سال: 2016

ISSN: 2179-8451,1677-1966

DOI: 10.5540/tema.2016.017.03.0321